Case Based Reasoning using K-Nearest Neighbor with Euclidean Distance for Early Diagnosis of Personality Disorder

نویسندگان

چکیده

A personality disorder is a condition of person with an extreme that causes the sufferer to have unhealthy and different thoughts patterns behavior from other people. The disorders discussed in this study consisted 110 diseases 300 case data 68 symptoms. Based on Basic Health Research (Riskesdas) 2018 data, it shows more than 19 million people aged 15 years over were affected by mental-emotional disorders. Data Statistics Indonesia 2019 population around 265 people, while according Indonesian Clinical Psychologist Association, number verified professional psychologists 1,599 clinical out total membership 2,078 as January 2019. However, figure does not meet standards World Organization (WHO), which serve 30 thousand This still lacks 28,970 psychologists. unequal distribution has made need long time provide diagnosis because patients being inversely proportional availability Indonesia. Moreover, there enough patient knowledge about symptoms they feel. aims produce system for diagnosing based reasoning solve problems occurred previous cases using K-Nearest Neighbor classify closest distance calculation Euclidean Distance. Algorithm testing used Confusion Matrix test. results 60 K-nearest Distance score K=3, known 100% similarity disorder. Meanwhile, new 10 base was also conducted showing 9 had case, another 90% case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm

Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...

متن کامل

Manifold Learning Using Euclidean -nearest Neighbor Graphs

In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sam...

متن کامل

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

Fast PNN-based Clustering Using K-nearest Neighbor Graph

Search for nearest neighbor is the main source of computation in most clustering algorithms. We propose the use of nearest neighbor graph for reducing the number of candidates. The number of distance calculations per search can be reduced from O(N) to O(k) where N is the number of clusters, and k is the number of neighbors in the graph. We apply the proposed scheme within agglomerative clusteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IJISTECH (International Journal of Information System and Technology)

سال: 2021

ISSN: ['2580-7250']

DOI: https://doi.org/10.30645/ijistech.v5i1.111